Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/AG01SLASHHASH3.19.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

DOUBLE₁(s₁(x)) -> DOUBLE₁(x)
PLUS₂(s₁(x), y) -> PLUS₂(x, y)
PLUS₂(s₁(x), y) -> MINUS₂(x, y)
PLUS₂(s₁(x), y) -> DOUBLE₁(y)
PLUS₂(s₁(x), y) -> PLUS₂(x, s₁(y))
PLUS₂(s₁(plus₂(x, y)), z) -> PLUS₂(plus₂(x, y), z)
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
PLUS₂(s₁(x), y) -> PLUS₂(minus₂(x, y), double₁(y))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

DOUBLE₁(s₁(x)) -> DOUBLE₁(x)
PLUS₂(s₁(x), y) -> PLUS₂(x, y)
PLUS₂(s₁(x), y) -> MINUS₂(x, y)
PLUS₂(s₁(x), y) -> DOUBLE₁(y)
PLUS₂(s₁(x), y) -> PLUS₂(x, s₁(y))
PLUS₂(s₁(plus₂(x, y)), z) -> PLUS₂(plus₂(x, y), z)
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
PLUS₂(s₁(x), y) -> PLUS₂(minus₂(x, y), double₁(y))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DOUBLE₁(s₁(x)) -> DOUBLE₁(x)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

DOUBLE₁(s₁(x)) -> DOUBLE₁(x)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
DOUBLE₁(x1) = DOUBLE₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > DOUBLE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
MINUS₂(x1, x2) = MINUS₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

PLUS₂(s₁(x), y) -> PLUS₂(x, y)
PLUS₂(s₁(x), y) -> PLUS₂(x, s₁(y))
PLUS₂(s₁(plus₂(x, y)), z) -> PLUS₂(plus₂(x, y), z)
PLUS₂(s₁(x), y) -> PLUS₂(minus₂(x, y), double₁(y))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PLUS₂(s₁(x), y) -> PLUS₂(x, y)
PLUS₂(s₁(x), y) -> PLUS₂(x, s₁(y))
PLUS₂(s₁(plus₂(x, y)), z) -> PLUS₂(plus₂(x, y), z)
PLUS₂(s₁(x), y) -> PLUS₂(minus₂(x, y), double₁(y))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PLUS₂(x1, x2) = PLUS₂(x1, x2)
s₁(x1) = s₁(x1)
plus₂(x1, x2) = plus₂(x1, x2)
minus₂(x1, x2) = x1
double₁(x1) = double₁(x1)
0 = 0

Lexicographic Path Order [19].
Precedence:

[PLUS₂, plus_2] > double₁ > s₁

The following usable rules [14] were oriented:

plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))
minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
double₁(0) -> 0
double₁(s₁(x)) -> s₁(s₁(double₁(x)))
plus₂(0, y) -> y
plus₂(s₁(x), y) -> s₁(plus₂(x, y))
plus₂(s₁(x), y) -> plus₂(x, s₁(y))
plus₂(s₁(x), y) -> s₁(plus₂(minus₂(x, y), double₁(y)))
plus₂(s₁(plus₂(x, y)), z) -> s₁(plus₂(plus₂(x, y), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.